Planar graph characterization of NDSS graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Planar Graph Characterization - Using γ - Stable Graphs

A graph G is said to be γ stable if γ(Gxy) = γ(G), for all x, y ∈ V (G), x is not adjacent to y, where Gxy denotes the graph obtained by merging the vertices x, y. In this paper we have provided a necessary and sufficient condition for Ḡ to be γ stable, where Ḡ denotes the complement of G. We have obtained a characterization of planar graphs when G and Ḡ are γ stable graphs. Key–Words: γ stable...

متن کامل

Mapping planar graphs into the Coxeter graph

We conjecture that every planar graph of odd-girth at least 11 admits a homomorphism to the Coxeter graph. Supporting this conjecture, we prove that every planar graph of odd-girth at least 17 admits a homomorphism to the Coxeter graph.

متن کامل

Graph Voronoi Regions for Interfacing Planar Graphs

Commanding motion is supported by a touch screen interface. Human input demonstrating trajectories by a sequence of points may be incomplete, distorted etc. Theses e ects are compensated by a transformation of vertex sequences of a regular grid into paths of a planar graph which codes feasible motions. The transformation is based on alteration operations including re-routings and on a so-called...

متن کامل

A characterization of planar median graphs

Median graphs have many interesting properties. One of them is—in connection with triangle free graphs—the recognition complexity. In general the complexity is not very fast, but if we restrict to the planar case the recognition complexity becomes linear. Despite this fact, there is no characterization of planar median graphs in the literature. Here an additional condition is introduced for the...

متن کامل

On combinatorial characterization of planar $st$ graphs

The notion of a planar st graph (also known as e-bipolar planar graph) is essentially equivalent to that of a progressive plane graph, which was introduced by Joyal and Street in the theory of graphical calculus for tensor categories. Fraysseix and Mendez have shown a bijection between equivalence classes of planar st embeddings of a directed graph G and the conjugate orders of the edge poset o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IOP Conference Series: Materials Science and Engineering

سال: 2017

ISSN: 1757-8981,1757-899X

DOI: 10.1088/1757-899x/263/4/042129